Combinatorial constructions for optimal supersaturated designs
نویسندگان
چکیده
منابع مشابه
Combinatorial constructions for optimal supersaturated designs
Combinatorial designs have long had substantial application in the statistical design of experiments, and in the theory of error-correcting codes. Applications in experimental and theoretical computer science, communications, cryptography and networking have also emerged in recent years. In this paper, we focus on a new application of combinatorial design theory in experimental design theory. E...
متن کاملOptimal mixed-level k-circulant supersaturated designs
Article history: Received 12 July 2007 Received in revised form 10 March 2008 Accepted 12 March 2008 Available online 18 March 2008 MSC: primary 62K15 secondary 62K05
متن کاملConstruction of Optimal Multi-Level Supersaturated Designs
A supersaturated design is a design whose run size is not large enough for estimating all the main effects. The goodness of multi-level supersaturated designs can be judged by the generalized minimum aberration criterion proposed by Xu and Wu [Ann. Statist. 29 (2001) 1066–1077]. A new lower bound is derived and general construction methods are proposed for multi-level supersaturated designs. In...
متن کاملUniform Designs and Their Combinatorial Constructions
Uniform designs has been widely used in various fields. In this talk, two constructions for uniform designs from combinatorics are presented. One is obtained by resolvable PPBDs which serves to unify some known combinatorial constructions. The other provides a recursive method to obtain a new three-level uniform design from old one.
متن کاملConstruction of E ( S 2 ) - Optimal Supersaturated Designs
Booth and Cox proposed the E(s) criterion for constructing twolevel supersaturated designs. Nguyen [Technometrics 38 (1996) 69– 73] and Tang and Wu [Canad. J. Statist 25 (1997) 191–201] independently derived a lower bound for E(s). This lower bound can be achieved only when m is a multiple of N − 1, where m is the number of factors and N is the run size. We present a method that uses difference...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2004
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(03)00269-3